Two instances of random access code in the quantum regime

Abstract We consider two classes of quantum generalisations random access code (RAC) and study the bounds for probabilities success such tasks. It provides a useful framework certain information processing tasks with constrained resources. The first class is based on RAC inputs output known as no-signalling (NS-QRAC) box (Grudka et al 2015 Phys. Rev. A 92 052312), where unbounded entanglement classical communication are allowed. show that it can be seen teleportation provide lower bound probability. modifications to NS-QRAC scenario: first, allowed second, bounded unconstrained find monogamy relation transmission fidelities, which—in contrast usual schemes—involves multiple senders single receiver. an upper latter one former. second channel shared (Tavakoli 2021 PRX Quantum 2 040357). set made digits d -base encoded over qudit maximally entangled state. dense-coding explicit protocols, which give tasks’ efficiency, in dimensions d = 2 , 3 4 . employed encoding utilises Gray codes.